INVESTIGATION INTO NEGATIVE-STIFFNESS VIBROISOLATION TABLE “MINUS K 500BM-1” / NEIGIAMOJO STANDUMO VIBROIZOLIACINIO STALIUKO „MINUS K 500BM-1“ TYRIMAS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The minus k-domination numbers in graphs

For any integer  ‎, ‎a minus  k-dominating function is a‎function  f‎ : ‎V (G)  {-1,0‎, ‎1} satisfying w) for every  vertex v, ‎where N(v) ={u V(G) | uv  E(G)}  and N[v] =N(v)cup {v}. ‎The minimum of ‎the values of  v)‎, ‎taken over all minus‎k-dominating functions f,‎ is called the minus k-domination‎number and is denoted by $gamma_k^-(G)$ ‎. ‎In this paper‎, ‎we ‎introduce the study of minu...

متن کامل

Minus domination number in k-partite graphs

A function f de1ned on the vertices of a graph G = (V; E); f :V → {−1; 0; 1} is a minus dominating function if the sum of its values over any closed neighborhood is at least one. The weight of a minus dominating function is f(V ) = ∑ v∈V f(v). The minus domination number of a graph G, denoted by −(G), equals the minimum weight of a minus dominating function of G. In this paper, a sharp lower bo...

متن کامل

Minus edge k-subdomination numbers in graphs

The closed neighborhood NG[e] of an edge e in a graph G is the set consisting of e and of all edges having a common end-vertex with e. Let f be a function on E(G), the edge set of G, into the set {−1, 0, 1}. If ∑ x∈N [e] f(x) ≥ 1 for at least k edges e of G, then f is called a minus edge k-subdominating function of G. The minimum of the values ∑ e∈E(G) f(e), taken over all minus edge k-subdomin...

متن کامل

3x+1 Minus the +

where d is a positive integer, 0≤ i< d and r0,r1, . . .rd−1 are rational numbers, such that the famous 3x+1 conjecture holds if and only if the R-orbit of 2n contains 2 for all positive integers n. We then show that the R-orbit of an arbitrary positive integer is a constant multiple of an orbit that contains a power of 2. Finally we apply our main result to show that any cycle {x0, . . . ,xm−1}...

متن کامل

Total minus domination in k-partite graphs

A function f defined on the vertices of a graph G = (V ,E), f : V → {−1, 0, 1} is a total minus dominating function (TMDF) if the sum of its values over any open neighborhood is at least one. The weight of a TMDF is the sum of its function values over all vertices. The total minus domination number, denoted by −t (G), of G is the minimum weight of a TMDF on G. In this paper, a sharp lower bound...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mokslas - Lietuvos ateitis

سال: 2012

ISSN: 2029-2341,2029-2252

DOI: 10.3846/mla.2011.112